Mixing Time of Random Walk on Poisson Geometry Small World
نویسندگان
چکیده
منابع مشابه
Mixing Time for a Random Walk on Rooted Trees
We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n2 steps are necessary and suffice for convergence to the stationary distribution.
متن کاملUniform Mixing Time for Random Walk on Lamplighter Graphs
Suppose that G is a finite, connected graph and X is a lazy random walk on G. The lamplighter chain X associated with X is the random walk on the wreath product G = Z2 oG, the graph whose vertices consist of pairs (f, x) where f is a labeling of the vertices of G by elements of Z2 and x is a vertex in G. There is an edge between (f, x) and (g, y) in G if and only if x is adjacent to y in G and ...
متن کاملThe Mixing Time for a Random Walk on the Symmetric Group Generated by Random Involutions
The involution walk is a random walk on the symmetric group generated by involutions with a number of 2cycles sampled from the binomial distribution with parameter p. This is a parallelization of the lazy transposition walk on the symmetric group. The involution walk is shown in this paper to mix for 1 2 ≤ p ≤ 1 fixed, n sufficiently large in between log1/p(n) steps and log2/(1+p)(n) steps. The...
متن کاملOn the mixing time of simple random walk on the super critical percolation cluster
It is shown that the mixing time of simple random walk on the super critical cluster inside the n × ... × n box in Z is θ(n), and that the Cheeger constant of the cluster inside the box is θ(n).
متن کاملLoop-Erased Random Walk and Poisson Kernel on Planar Graphs
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into C so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2015
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2015.1012608